Baum–Katz type theorems with exact threshold
نویسندگان
چکیده
منابع مشابه
Exact k-Wise Intersection Theorems
A typical problem in extremal combinatorics is the following. Given a large number n and a set L, find the maximum cardinality of a family of subsets of a ground set of n elements such that the intersection of any two subsets has cardinality in L. We investigate the generalization of this problem, where intersections of more than 2 subsets are considered. In particular, we prove that when k − 1...
متن کاملWeights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute value) of the coefficients required to represent such functions. These bounds are very close and in the linear case in particular they are almost matching. The quantity is the same as the maximum magnitude of integer co...
متن کاملExact Quantum Query Complexity of EXACT and THRESHOLD
A quantum algorithm is exact if it always produces the correct answer, on any input. Coming up with exact quantum algorithms that substantially outperform the best classical algorithm has been a quite challenging task. In this paper, we present two new exact quantum algorithms for natural problems: for the problem EXACTk in which we have to determine whether the sequence of input bits x1, . . ....
متن کاملOn Probabilistic ACC Circuits with an Exact-Threshold Output Gate
Let SYM + denote the class of Boolean functions computable by depth-two size-n log O(1) n circuits with a symmetric-function gate at the root and AND gates of fan-in log O(1) n at the next level, or equivalently, the class of Boolean functions f such that f(x1; : : : ; xn) can be expressed as f(x1; : : : ; xn) = hn(pn(x1; : : : ; xn)) for some polynomial pn over Z of degree log O(1) n and norm ...
متن کاملRamsey-type Theorems with Forbidden Subgraphs
A graph is called H-free if it contains no induced copy of H . We discuss the following question raised by Erdős and Hajnal. Is it true that for every graph H , there exists an ε(H) > 0 such that any H-free graph with n vertices contains either a complete or an empty subgraph of size at least n? We answer this question in the affirmative for a special class of graphs, and give an equivalent ref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastics
سال: 2017
ISSN: 1744-2508,1744-2516
DOI: 10.1080/17442508.2017.1366490